By using SIAM Journals Online you agree to abide by the
Terms and Conditions of Use.

©  SIAM

 

SIAM Journal on Computing

Table of Contents
Search This Issue
Volume 35, Issue 6, pp. 1283-1525

Please Note: Electronic articles are available well in advance of the printed articles.

What Article options are available ?   View Cart   

An Algorithm for Computing Fundamental Solutions

Klaus Weihrauch and Ning Zhong

pp. 1283-1294

BibTeX  Abstract Full Text:  PDF

Compact Labeling Scheme for Ancestor Queries

Serge Abiteboul, Stephen Alstrup, Haim Kaplan, Tova Milo, and Theis Rauhe

pp. 1295-1309

BibTeX  Abstract Full Text:  PDF

Quantum Query Complexity of Some Graph Problems

Christoph Dürr, Mark Heiligman, Peter HOyer, and Mehdi Mhalla

pp. 1310-1328

BibTeX  Abstract Full Text:  PDF

The Approximability of Three-valued MAX CSP

Peter Jonsson, Mikael Klasson, and Andrei Krokhin

pp. 1329-1349

BibTeX  Abstract Full Text:  PDF

Balanced Allocations: The Heavily Loaded Case

Petra Berenbrink, Artur Czumaj, Angelika Steger, and Berthold Vöcking

pp. 1350-1385

BibTeX  Abstract Full Text:  PDF

Linearization and Completeness Results for Terminating Transitive Closure Queries on Spatial Databases

Floris Geerts, Bart Kuijpers, and Jan Van den Bussche

pp. 1386-1439

BibTeX  Abstract ALLOW Full Text:  PDF

Partial Match Queries in Random k-d Trees

Hua-Huai Chern and Hsien-Kuei Hwang

pp. 1440-1466

BibTeX  Abstract Full Text:  PDF

Power from Random Strings

Eric Allender, Harry Buhrman, Michal Koucký, Dieter van Melkebeek, and Detlef Ronneburger

pp. 1467-1493

BibTeX  Abstract Full Text:  PDF

Fully Dynamic Orthogonal Range Reporting on RAM

Christian Worm Mortensen

pp. 1494-1525

BibTeX  Abstract ALLOW Full Text:  PDF